package Leetcode;

public class Leetcode_204 {
    public static int integerReplacement(int n) {
        if (n == 1) {
            return 0;
        }
        if (n % 2 == 0) {
            return 1 + integerReplacement(n / 2);
        }
        return 2 + Math.min(integerReplacement(n / 2), integerReplacement(n / 2 + 1));
    }

    public static void main(String[] args) {
        int n = 8;
        System.out.println(integerReplacement(n));
    }
}
